On the universality of the Kolmogorov constant

نویسنده

  • Katepalli R. Sreenivasan
چکیده

All known data are collected on the Kolmogorov constant in one-dimensional spectral formula for the inertial range. For large enough microscale Reynolds numbers, the data (despite much scatter) support the notion of a “universal” constant that is independent of the flow as well as the Reynolds number, with a numerical value of about 0.5. In particular, it is difficult to discern support for a recent claim that the constant is Reynolds number dependent even at high Reynolds numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Universality of the Kolmogorov Constant in Numerical Simulations of Turbulence

Motivated by a recent survey of experimental data [K.R. Sreenivasan, Phys. Fluids 7, 2778 (1995)], we examine data on the Kolmogorov spectrum constant in numerical simulations of isotropic turbulence, using results both from previous studies and from new direct numerical simulations over a range of Reynolds numbers (up to 240 on the Taylor scale) at grid resolutions up to 512. It is noted that ...

متن کامل

RG Analysis of the Kolmogorov Cascade in Isotropic Turbulence

We review the application of renormalization group (RG) methods to the problem of isotropic turbulence, with attention to Kolmogorov’s phenomenological scaling law. We see that RG reproduces the form of the 5/3 law and can also be used to obtain estimates of the Kolmogorov constant that agree with experiment and numerical simulation. The articles reviewed also confirm the universality of the sc...

متن کامل

Kolmogorov Complexity: Sources, Theory and Applications

The theory of Kolmogorov complexity is based on the discovery, by Alan Turing in 1936, of the universal Turing machine. After proposing the Turing machine as an explanation of the notion of a computing machine, Turing found that there exists one Turing machine which can simulate any other Turing machine. Complexity, according to Kolmogorov, can be measured by the length of the shortest program ...

متن کامل

On the ERG approach in 3 − d Well Developed Turbulence ∗

We apply the method of the Renormalization Group (GR), following the Polchinski point of view, to a model of well developed and isotropic fluid turbulence. The Galilei-invariance is preserved and a universality behavior, related to the change of the stochastic stirring force, is evident by the numerical results in the inertial region, where a scale-invariant behavior also appear. The expected p...

متن کامل

Differences between Kolmogorov Complexity and Solomonoff Probability: Consequences for AGI

Kolmogorov complexity and algorithmic probability are compared in the context of the universal algorithmic intelligence. Accuracy of time series prediction based on single best model and on averaging over multiple models is estimated. Connection between inductive behavior and multi-model prediction is established. Uncertainty as a heuristic for reducing the number of used models without losses ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999